Three-step iterative methods with optimal eighth-order convergence
نویسندگان
چکیده
In this paper, based on Ostrowski’s method, a new family of eighth-order methods for solving nonlinear equations is derived. In terms of computational cost, each iteration of these methods requires three evaluations of the function and one evaluation of its first derivative, so that their efficiency indices are 1.682, which is optimal according to Kung and Traub’s conjecture. Numerical comparisons are made to show the performance of the new family.
منابع مشابه
Three-step iterative methods with eighth-order convergence for solving nonlinear equations
A family of eighth-order iterative methods for solution of nonlinear equations is presented. We propose an optimal three-step method with eight-order convergence for finding the simple roots of nonlinear equations by Hermite interpolation method. Per iteration of this method requires two evaluations of the function and two evaluations of its first derivative, which implies that the efficiency i...
متن کاملFamily of Optimal Eighth-Order of Convergence for Solving Nonlinear Equations
In this paper, a new family of optimal eighth-order iterative methods are presented. The new family is developed by combining Traub-Ostrowski’s fourth-order method adding Newton’s method as a third step and using the forward divided difference and three real-valued functions in the third step to reduce the number of function evaluations. We employed several numerical comparisons to demonstrate ...
متن کاملOn a New Iterative Scheme without Memory with Optimal Eighth Order
The purpose of this paper is to derive and discuss a three-step iterative expression for solving nonlinear equations. In fact, we derive a derivative-free form for one of the existing optimal eighth-order methods and preserve its convergence order. Theoretical results will be upheld by numerical experiments.
متن کاملOn Generalization Based on Bi et al. Iterative Methods with Eighth-Order Convergence for Solving Nonlinear Equations
The primary goal of this work is to provide a general optimal three-step class of iterative methods based on the schemes designed by Bi et al. (2009). Accordingly, it requires four functional evaluations per iteration with eighth-order convergence. Consequently, it satisfies Kung and Traub's conjecture relevant to construction optimal methods without memory. Moreover, some concrete methods of t...
متن کاملNew Efficient Optimal Derivative-Free Method for Solving Nonlinear Equations
In this paper, we suggest a new technique which uses Lagrange polynomials to get derivative-free iterative methods for solving nonlinear equations. With the use of the proposed technique and Steffens on-like methods, a new optimal fourth-order method is derived. By using three-degree Lagrange polynomials with other two-step methods which are efficient optimal methods, eighth-order methods can b...
متن کاملA Family of Optimal Derivative Free Iterative Methods with Eighth-Order Convergence for Solving Nonlinear Equations
In this paper, modification of Steffensen’s method with eight-order convergence is presented. We propose a family of optimal three-step methods with eight-order convergence for solving the simple roots of nonlinear equations by using the weight function and interpolation methods. Per iteration this method requires four evaluations of the function which implies that the efficiency index of the d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Computational Applied Mathematics
دوره 235 شماره
صفحات -
تاریخ انتشار 2011